Determining the Optimal Rice Distribution Route in Medan City Using Dijkstra's Algorithm

نویسندگان

چکیده

Distribution is an activity carried out to spread the product throughout market so that consumers can buy it. also affect price of goods. Therefore, distribution must be effective. The purpose this study determine shortest route effective in prices are not high and company does suffer losses. data analysis method used Dijkstra's Algorithm obtained with on distance between starting point destination through predetermined points. calculation results show fastest routes taken based dijkstra algorithm are: A-20-19-F-26-C-D-11-12-B-E a 40.71 km. There several road chosen but Medan Rice Distributors expected choose transportation rice quickly optimally.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

fault location in power distribution networks using matching algorithm

چکیده رساله/پایان نامه : تاکنون روش‏های متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روش‏ها در شبکه توزیع به دلایلی همچون وجود انشعاب‏های متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تک‏فاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...

On The Optimization of Dijkstras Algorithm

In this paper, we propose some amendment on Dijkstra’s algorithm in order to optimize it by reducing the number of iterations. The main idea is to solve the problem where more than one node satisfies the condition of the second step in the traditional Dijkstra’s algorithm. After application of the proposed modifications, the maximum number of iterations of Dijkstra’s algorithm is less than the ...

متن کامل

Optimal Reconfiguration and Capacitor Allocation in Radial Distribution Systems Using the Hybrid Shuffled Frog Leaping Algorithm in the Fuzzy Framework

In distribution systems, in order to diminish power losses and keep voltage profiles within acceptable limits, network reconfiguration and capacitor placement are commonly used. In this paper, the Hybrid Shuffled Frog Leaping Algorithm (HSFLA) is used to optimize balanced and unbalanced radial distribution systems by means of a network reconfiguration and capacitor placement. High accuracy and ...

متن کامل

Investigate the Applicability of Gray Wolf Optimization Algorithm in Determining the Optimal Dimensions of Concrete Dams

Acquiring optimal dimensions of concrete dams by reducing the cross section will reduce the volume of concrete used and consequently reduce construction costs. Due to multiplicity of constraints which leads to complexity of the decision space, meta-heuristic optimization algorithms have been increasingly used in optimal design of gravity dams. In this study, performance of Grey Wolf Optimizer w...

متن کامل

Comparative Analysis of Floyd Warshall and Dijkstras Algorithm using Opencl

Shortest path algorithms finds applications in large real world domains. All pair shortest path (APSP) and single source shortest path (SSSP) both have their special applications domains. All though every SSSP can be applied for all vertices to calculate APSP. But APSP cant. In this paper heterogeneous implementation of Floyd warshalls algorithm and Dijkstra’s algorithm is compared on dense gra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: JKIE (Journal Knowledge Industrial Engineering)

سال: 2022

ISSN: ['2541-4461']

DOI: https://doi.org/10.35891/jkie.v9i2.3288